3 . 3 Improved ratio using Dirty - Paper Coding ( DPC ) based strategies
نویسندگان
چکیده
(x1 − x̂1) 2 ] The Witsenhausen counterexample [Witsenhausen’68] is a distributed Linear-Quadratic-Gaussian problem for which nonlinear control laws outperform the optimal linear control law. The optimal control law is still elusive — and the non-Gaussian relaxation of the problem is known to be NPcomplete [Papadimitriou and Tsitsiklis ’86]. The counterexample has an implicit channel that makes it hard. The first controller modifies the initial state and attempts to communicate themodified state to the second controller through a noisy channel. Solving the problem of minimizing MMSE error in estimating x̂1 with an average power constrained u1 is an equivalent formulation.
منابع مشابه
Multicell Downlink Capacity with Coordinated Processing
This paper considers the application of cooperative base-station (BS) transmission schemes to the downlink of multicell networks. Based on a simplified Wyner-type network model with users clustered at the cell-edges, closed form sum rate expressions for non-fading channels are derived for dirty-paper coding (DPC), linear zero-forcing (ZF) precoding, and co-phasing with reuse. By extending the m...
متن کاملDownlink Performance of 2-cell Cooperation Schemes in a Multi-cell Environment
Cooperative transmission schemes are used in wireless networks to improve the spectral efficiency. In a multi-cell environment, other cell interference (OCI) degrades the performance of wireless systems. In this paper, we study the performance of downlink sum rate for cell-edge users in a multi-cell environment under base station cooperation. The base-stations coordinate their transmission to t...
متن کاملEnhancing Non-Orthogonal Multiple Access By Forming Relaying Broadcast Channels
In this paper, using relaying broadcast channels (RBCs) as component channels for non-orthogonal multiple access (NOMA) is proposed to enhance the performance of NOMA in single-input single-output (SISO) cellular downlink systems. To analyze the performance of the proposed scheme, an achievable rate region of a RBC with compress-and-forward (CF) relaying is newly derived based on the recent wor...
متن کاملTwo-Level Dirty Paper Coding
We propose a two-level coding and successive decoding for dirty paper coding (DPC). We divide the channel code into two levels, the upper code interacting with the shaping code and the lower code that does not, such that it is information lossless. Furthermore, the code design becomes more intuitive and its analysis becomes clearer since the lower code can be designed using any conventional cod...
متن کاملThe Robustness of Dirty Paper Coding and The Binary Dirty Multiple Access Channel with Common Interference
A dirty-paper channel is considered, where the transmitter knows the interference sequence up to a constant multiplicative factor, known only to the receiver. Lower bounds on the achievable rate of communication are derived by proposing a coding scheme that partially compensates for the imprecise channel knowledge. We focus on a communication scenario where the signalto-noise ratio is high. Our...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009